Consecutive Ones Property
ثبت نشده
چکیده
منابع مشابه
A Test for the Consecutive Ones Property on Noisy Data
A (0,1)-matrix satisfies the consecutive ones property (COP) for the rows if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. The consecutive ones test is useful for DNA sequence assembly, for example, in the STS content mapping of YAC library, and in the Bactig assembly based on STS as well as EST
متن کاملA Simple Test for the Consecutive Ones Property
A (0,1)-matrix satisfies the consecutive ones property if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. Booth and Lueker [1976] designed a linear time testing algorithm for this property based on a data structure called "PQ-trees". This procedure is quite complicated and the linear time amortized analysis is also rather involved. We de...
متن کاملPC trees and circular-ones arrangements
A 0-1 matrix has the consecutive-ones property if its columns can be ordered so that the ones in every row are consecutive. It has the circular-ones property if its columns can be ordered so that, in every row, either the ones or the zeros are consecutive. PQ trees are used for representing all consecutive-ones orderings of the columns of a matrix that has the consecutive-ones property. We give...
متن کاملA note on the Consecutive Ones Submatrix problem
A binary matrix has the Consecutive Ones Property (C1P) for columns if there exists a permutation of its rows that leaves the 1’s consecutive in every column. The problem of Consecutive Ones Property for a matrix is a special variant of Consecutive Ones Submatrix problem in which a positive integer K is given and we want to know if there exists a submatrix B of A consisting of K columns of A wi...
متن کاملSet covering with almost consecutive ones property
In this paper we consider set covering problems with a coefficient matrix almost having the consecutive ones property, i.e., in many rows of the coefficient matrix, the ones appear consecutively. If this property holds for all rows it is well known that the set covering problem can be solved efficiently. For our case of almost consecutive ones we present a reformulation exploiting the consecuti...
متن کاملOn Physical Mapping Algorithms - An Error-Tolerant Test for the Consecutive Ones Property
An important problem in physical mapping is to test the consecutive ones property of a (0,1)-matrix: that is, whether it is possible to permute the columns so that each row of the resulting matrix has the ones occur in a consecutive block. This is useful, for example, in probe hybridization for cosmid clones and in the STS content mapping of YAC library. The linear time algorithm by Booth and L...
متن کامل